- recursion equations
- Программирование: уравнения рекурсии
Универсальный англо-русский словарь. Академик.ру. 2011.
recursion equations
Смотреть что такое "recursion equations" в других словарях:
Recursion — Recursion, in mathematics and computer science, is a method of defining functions in which the function being defined is applied within its own definition. The term is also used more generally to describe a process of repeating objects in a self… … Wikipedia
Recursion theory — Recursion theory, also called computability theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown to include the study of generalized computability… … Wikipedia
Kleene's recursion theorem — In computability theory, Kleene s recursion theorems are a pair of fundamental results about the application of computable functions to their own descriptions. The theorems were first proved by Stephen Kleene in 1938.This article uses the… … Wikipedia
Course-of-values recursion — In computability theory, course of values recursion is a technique for defining number theoretic functions by recursion. In a definition of a function f by course of values recursion, the value of f(n+1) is computed from the sequence . The fact… … Wikipedia
Levinson recursion — or Levinson Durbin recursion is a procedure in linear algebra to recursively calculate the solution to an equation involving a Toeplitz matrix. The algorithm runs in Θ(n2) time, which is a strong improvement over Gauss Jordan elimination, which… … Wikipedia
System of linear equations — In mathematics, a system of linear equations (or linear system) is a collection of linear equations involving the same set of variables. For example,:egin{alignat}{7}3x ; + ; 2y ; ; z ; = ; 1 2x ; ; 2y ; + ; 4z ; = ; 2 x ; + ; frac{1}{2} y ; ; z … Wikipedia
Arkadi Beinussowitsch Migdal — Arkadi Beinussowitsch[1] Migdal (russisch Аркадий Бейнусович (Бенедиктович) Мигдал; * 26. Februarjul./ 11. März 1911greg. in Lida, Weißrussland; † 9. Februar 1991 in Princeton (New Jersey)) war ein führender russischer… … Deutsch Wikipedia
Arkadi Migdal — Arkadi Beinussowitsch[1] Migdal (russisch Аркадий Бейнусович (Бенедиктович) Мигдал; * 26. Februarjul./ 11. März 1911greg. in Lida, Weissrussland; † 9. Februar 1991 in Princeton (New Jersey)) war ein führender russischer theoretischer Physiker.… … Deutsch Wikipedia
Arkadij Migdal — Arkadi Beinussowitsch[1] Migdal (russisch Аркадий Бейнусович (Бенедиктович) Мигдал; * 26. Februarjul./ 11. März 1911greg. in Lida, Weissrussland; † 9. Februar 1991 in Princeton (New Jersey)) war ein führender russischer theoretischer Physiker.… … Deutsch Wikipedia
Μ-recursive function — In mathematical logic and computer science, the μ recursive functions are a class of partial functions from natural numbers to natural numbers which are computable in an intuitive sense. In fact, in computability theory it is shown that the μ… … Wikipedia
Computability theory — For the concept of computability, see Computability. Computability theory, also called recursion theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown … Wikipedia
